Cluster Analysis of Online Shop Product Reviews Using K-Means Clustering
نویسندگان
چکیده
منابع مشابه
Cluster Analysis Using Rough Clustering and k-Means Clustering
IntroductIon Cluster analysis is a fundamental data reduction technique used in the physical and social sciences. It is of potential interest to managers in Information Science, as it can be used to identify user needs though segmenting users such as Web site visitors. In addition, the theory of Rough sets is the subject of intense interest in computational intelligence research. The extension ...
متن کاملRanking and Clustering Iranian Provinces Based on COVID-19 Spread: K-Means Cluster Analysis
Introduction: The Coronavirus has crossed geographical borders. This study was performed to rank and cluster Iranian provinces based on coronavirus disease (COVID-19) recorded cases from February 19 to March 22, 2020. Materials and Methods: This cross-sectional study was conducted in 31 provinces of Iran using the daily number of confirmed cases. Cumulative Frequency (CF) and Adjusted CF (ACF)...
متن کاملK-Means Clustering Using Localized Histogram Analysis
The first step required for many applications and algorithms is the segmentation or clustering of an image. This intuitively easy problem is actually very difficult for a computer to automatically perform. While having an effective solution to this problem would be valuable for all types of image processing, it would be especially useful in medical imaging. One method that addresses this proble...
متن کاملA fast k-means clustering algorithm using cluster center displacement
In this paper, we present a fuzzy k-means clustering algorithm using the cluster center displacement between successive iterative processes to reduce the computational complexity of conventional fuzzy k-means clustering algorithm. The proposed method, referred to as CDFKM, first classifies cluster centers into active and stable groups. Our method skips the distance calculations for stable clust...
متن کاملAn Algorithm for Online K-Means Clustering
This paper shows that one can be competitive with the kmeans objective while operating online. In this model, the algorithm receives vectors v1, . . . , vn one by one in an arbitrary order. For each vector vt the algorithm outputs a cluster identifier before receiving vt+1. Our online algorithm generates Õ(k) clusters whose k-means cost is Õ(W ∗) where W ∗ is the optimal k-means cost using k cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJEBD (International Journal Of Entrepreneurship And Business Development)
سال: 2020
ISSN: 2597-4785,2597-4750
DOI: 10.29138/ijebd.v3i02.977